Bounded Prefix-Suffix Duplication
نویسندگان
چکیده
Abs t r ac t . We consider a restricted variant of the prefix-sufñx duplication operation, called bounded prefix-sufñx duplication. It consists in the iterative duplication of a prefix or suffix, whose length is bounded by a constant, of a given word. We give a sufncient condition for the closure under bounded prefix-sufñx duplication of a class of languages. Consequently, the class of regular languages is closed under bounded prefix-sufñx duplication; furthermore, we propose an algorithm deciding whether a regular language is a finite fc-prefix-suffix duplication language. An efficient algorithm solving the membership problem for the fc-prefix-suffix duplication of a language is also presented. Finally, we define the fc-prefix-suffix duplication distance between two words, extend it to languages and show how it can be computed for regular languages.
منابع مشابه
An(other) Entropy-Bounded Compressed Suffix Tree
Suffix trees are among the most important data structures in stringology, with myriads of applications. Their main problem is space usage, which has triggered much research striving for compressed representations that are still functional. We present a novel compressed suffix tree. Compared to the existing ones, ours is the first achieving at the same time sublogarithmic complexity for the oper...
متن کاملReverse Engineering Prefix Tables
The Prefix table of a string reports for each position the maximal length of its prefixes starting here. The Prefix table and its dual Suffix table are basic tools used in the design of the most efficient string-matching and pattern extraction algorithms. These tables can be computed in linear time independently of the alphabet size. We give an algorithmic characterisation of a Prefix table (it...
متن کاملOn Generation of Permutations through Suffix/Prefix Reversing in a Cellular Network
In this paper a new permutation generator is proposed. Each subsequent permutation is generated in a cellular permutation network by reversing a suffix/prefix of the preceding permutation. The sequence of suffix/prefix sizes is computed by a complex parallel counter in O(1) time per generated object. Suffix/prefix reversing operations are performed at the same time when the permutation is actua...
متن کاملImproved Filters for the Approximate Suffix-Prefix Overlap Problem
Computing suffix-prefix overlaps for a large collection of strings is a fundamental building block for the analysis of genomic next-generation sequencing data. The approximate suffix-prefix overlap problem is to find all pairs of strings from a given set such that a prefix of one string is similar to a suffix of the other. Välimäki et al. (Information and Computation, 2012) gave a solution to t...
متن کامل